Repairing locality is an appreciated feature for distributed storage, inwhich a damaged or lost data share can be repaired by accessing a subset ofother shares much smaller than is required for decoding the complete data.However for Secret Sharing (SS) schemes, it has been proven theoretically thatlocal repairing can not be achieved with perfect security for the majority ofthreshold SS schemes, where all the shares are equally regarded in both secretrecovering and share repairing. In this paper we make an attempt on decouplingthe two processes to make secure local repairing possible. Dedicated repairingredundancies only for the repairing process are generated, which are randomnumbers to the original secret. Through this manner a threshold SS scheme withimproved repairing locality is achieved on the condition that security ofrepairing redundancies is ensured, or else our scheme degenerates into aperfect access structure that is equivalent to the best existing schemes cando. To maximize security of the repairing redundancies, a random placementmechanism is also proposed.
展开▼
